combinator

combinator
комбинатор (лямбда-выражение, не содержащее свободных переменных)

English-Russian dictionary of computer science and programming. 2013.

Игры ⚽ Нужна курсовая?

Смотреть что такое "combinator" в других словарях:

  • combinator — COMBINATÓR, OÁRE, combinatori, oare, adj., s.n. 1. adj. Care combină, care determină o combinaţie. 2. s.n. Aparat care poate realiza combinaţii de asociaţie între maşini, aparate şi instrumente electrice. – Din rus. kombinator, fr. combinateur.… …   Dicționar Român

  • Combinator library — A combinator library is a software library which implements combinators for a functional programming language; the key idea is this: a combinator library offers functions (the combinators) that combine functions together to make bigger functions …   Wikipedia

  • combinator — noun A higher order function that solely uses function application and earlier defined combinators on its arguments …   Wiktionary

  • combinator — …   Useful english dictionary

  • Fixed-point combinator — Y combinator redirects here. For the technology venture capital firm, see Y Combinator (company). In computer science, a fixed point combinator (or fixpoint combinator[1] ) is a higher order function that computes a fixed point of other functions …   Wikipedia

  • Y Combinator (компания) — У этого термина существуют и другие значения, см. Комбинатор неподвижной точки. Y Combinator …   Википедия

  • Fixed point combinator — A fixed point combinator (or fixed point operator) is a higher order function that computes a fixed point of other functions. This operation is relevant in programming language theory because it allows the implementation of recursion in the form… …   Wikipedia

  • Y Combinator — Infobox Company company name = Y Combinator company company type = Limited liability company foundation = 2005 key people = location = industry = Venture Capital products = Investments assets = homepage = [http://www.ycombinator.com/… …   Wikipedia

  • SKI combinator calculus — is a computational system that is a reduced, untyped version of Lambda calculus. All operations in Lambda calculus are expressed in SKI as binary trees whose leaves are one of the three symbols S, K, and I (called combinators). In fact, the… …   Wikipedia

  • Parser combinator — In functional programming, a parser combinator is a higher order function which accepts several parsers as input and returns a new parser as its output. In this context, a parser is a function accepting strings as input and returning some… …   Wikipedia

  • Parser Combinator — In mathematics and functional programming, Higher Order functions (HOF) are defined as the functions that can take functions as their input and can also produce functions as their output. The use of a HOF as an infix operator in a function… …   Wikipedia


Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»